On the unary equivalence of stochastic languages and stochastic context-free languages
نویسندگان
چکیده
We show that every unary stochastic context-free grammar with polynomially bounded ambiguity, has an equivalent probabilistic automaton.
منابع مشابه
Parikh Image of Pushdown Automata
We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with n states and p ≥ 2n + 4 stack symbols that accepts one single long word for which every equivalent contextfree grammar needs Ω(n(p− 2n− 4)) variables. This family shows that the classical algorithm for converting a PDA to an equivalent contextfree...
متن کاملLearning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm
A genetic algorithm for inferring stochastic context-free grammars from nite language samples is described. Solutions to the inference problem are evolved by optimizing the parameters of a covering grammar for a given language sample. We describe a number of experiments in learning grammars for a range of formal languages. The results of these experiments are encouraging and compare very favour...
متن کاملParikh’s Theorem for Weighted and Probabilistic Context-Free Grammars
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear co...
متن کاملExtending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars
We prove an analog of Parikh’s theorem for weighted context-free grammars over commutative, idempotent semirings, and exhibit a stochastic context-free grammar with behavior that cannot be realized by any stochastic right-linear context-free grammar. Finally, we show that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent stochastic right-linear co...
متن کاملTwo Algorithms for Learning the Parameters of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) are often used to represent the syntax of natural languages. Most algorithms for learning them require storage and repeated processing of a sentence corpus. The memory and computational demands of such algorithms are illsuited for embedded agents such as a mobile robot. Two algorithms are presented that incrementally learn the parameters of stochastic co...
متن کامل